On Diversity-Multiplexing Tradeoff in Multiple-Relay Networks

نویسندگان

  • Shahab Oveis Gharan
  • Alireza Bayesteh
  • Amir K. Khandani
چکیده

This paper studies the setup of a multiple-relay network in which K half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are assumed to be either connected through a quasi-static Rayleigh fading channel, or disconnected. We propose a new scheme, which we call random sequential (RS), based on the amplify-and-forward relaying. We prove that for general multiple-antenna multiple-relay networks, the proposed scheme achieves the maximum diversity gain. Furthermore, we derive diversity-multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. Finally, we show that for single-antenna multiple-access multiple-relay (K > 1) networks (without direct link between the transmitter(s) and the receiver), the proposed RS scheme achieves the optimum DMT. However, for the case of multiple access single relay setup, the RS scheme reduces to the naive amplify-and-forward relaying and is not optimum in terms of DMT, while the dynamic decode-and-forward scheme performs optimum for this scenario 1 .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the diversity: multiplexing tradeoff in multiple-relay network

This paper studies the setup of a multiple-relay network in which K half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each two nodes are assumed to be either connected through a quasi-static Rayleigh fading channel, or disconnected. We propose a new scheme, which we call random sequential (RS), based...

متن کامل

Select and Forward: Unifying Cooperative Diversity and Routing in a common framework

We study the diversity multiplexing tradeoff in cooperative diversity systems involving multiple relays. We show that distributed space time codes are not always fundamentally necessary in realizing the potential gains in these systems. In particular, under a wide variety of scenarios, we show that a smart relay selection algorithm in conjunction with conventional protocols for the three node s...

متن کامل

Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and asynchronous space-time coded cooperative diversity schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function, we show that the proposed...

متن کامل

Cooperative Multiplexing in a Half Duplex Relay Network: Performance and Constraints

Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain. Specifically, consider a network in which a single source node is equipped with one antenna and a destination is equipped with two antennas. It is shown that, in certai...

متن کامل

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

In this paper, we consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links and single-antenna relay nodes operating under the half-duplex constraint. We present protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of networks. Networks belonging to the first class can be viewed as the union of K node-disjoin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0803.3117  شماره 

صفحات  -

تاریخ انتشار 2008